TADD: A Computational Framework for Data Analysis Using Discrete Morse Theory
نویسندگان
چکیده
This paper presents a computational framework that allows for a robust extraction of the extremal structure of scalar and vector fields on 2D manifolds embedded in 3D. This structure consists of critical points, separatrices, and periodic orbits. The framework is based on Forman’s discrete Morse theory, which guarantees the topological consistency of the computed extremal structure. Using a graph theoretical formulation of this theory, we present an algorithmic pipeline that computes a hierarchy of extremal structures. This hierarchy is defined by an importance measure and enables the user to select an appropriate level of detail.
منابع مشابه
Computational Discrete Morse Theory for Divergence-Free 2D Vector Fields
We present a simple approach to the topological analysis of divergencefree 2D vector fields using discrete Morse theory. We make use of the fact that the point-wise perpendicular vector field can be interpreted as the gradient of the stream function. The topology of the divergence-free vector field is thereby encoded in the topology of a gradient vector field. We can therefore apply a formulati...
متن کاملComputing Persistent Homology via Discrete Morse Theory
This report provides theoretical justification for the use of discrete Morse theory for the computation of homology and persistent homology, an overview of the state of the art for the computation of discrete Morse matchings and motivation for an interest in these computations, particularly from the point of view of topological data analysis. Additionally, a new simulated annealing based method...
متن کاملTopological analysis of discrete scalar data
This thesis presents a novel computational framework that allows for a robust extraction and quantification of the Morse-Smale complex of a scalar field given on a 2or 3dimensional manifold. The proposed framework is based on Forman’s discrete Morse theory, which guarantees the topological consistency of the computed complex. Using a graph theoretical formulation of this theory, we present an a...
متن کاملDiscrete Morse Theoretic Algorithms for Computing Homology of Complexes and Maps
We provide explicit and efficient reduction algorithms based on discrete Morse theory to simplify homology computation for a very general class of complexes. A set-valued map of top-dimensional cells between such complexes is a natural discrete approximation of an underlying (and possibly unknown) continuous function, especially when the evaluation of that function is subject to measurement err...
متن کاملComputational Topology in Text Mining
In this paper we present our ongoing research on applying computational topology to analysis of structure of similarities within a collection of text documents. Our work is on the fringe between text mining and computational topology, and we describe techniques from each of these disciplines. We transform text documents to the so-called vector space model, which is often used in text mining. Th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010